Béla Andrásfai, Introductory Graph Theory (Adam Hilger, 1977), 268pp., £800.
نویسندگان
چکیده
منابع مشابه
Introductory Cardinality Theory
The initial definition of finiteness says no more than a set is finite if we can “count” its elements. Counting means establishing a one-to-one correspondence with a set of consecutive integers beginning with one. Thus, if f is a function mapping {1,2,..., } n oneto-one onto a set A, we “count” A as (1), (2),..., ( ) f f f n . The fact that f is one-to-one and onto ensures that each element of ...
متن کاملIntroductory Number Theory
We will start with introducing congruences and investigating modular arithmetic: the set Z/nZ of “integers modulo n” forms a ring. This ring is a field if and only if n is a prime number. A study of the multiplicative structure leads to Fermat’s Little Theorem (for prime n) and to the Euler phi function and Euler’s generalization of Fermat’s Theorem. Another basic tool is the Chinese Remainder ...
متن کاملIntroductory Fredholm theory and computation
We provide an introduction to Fredholm theory and discuss using the Fredholm determinant to compute pure-point spectra.
متن کاملPort-Hamiltonian Systems Theory: An Introductory Overview Port-Hamiltonian Systems Theory: An Introductory Overview
An up-to-date survey of the theory of port-Hamiltonian systems is given, emphasizing novel developments and relationships with other formalisms. Port-Hamiltonian systems theory yields a systematic framework for network modeling of multi-physics systems. Examples from different areas show the range of applicability. While the emphasis is on modeling and analysis, the last part provides a brief i...
متن کامل1 8 M ay 2 00 8 COPS AND ROBBERS IN A RANDOM GRAPH DRAFT BÉLA
We consider the pursuit and evasion game on finite, connected, undirected graphs known as cops and robbers. Meyniel conjectured that for every graph on n vertices O(n 1
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the Edinburgh Mathematical Society
سال: 1979
ISSN: 0013-0915,1464-3839
DOI: 10.1017/s0013091500027917